Gap-Definability as a Closure Property
نویسندگان
چکیده
منابع مشابه
Gap-Definability as a Closure Property
Gap-definability and the gap closure operator were defined by S. Fenner, L. Fortnow and S. Kurth (J. Comput. System Sci. 48, 116 148 (1994)). Few complexity classes were known at that time to be gapdefinable. In this paper, we give simple characterizations of both gapdefinability and the gap-closure operator, and we show that many complexity classes are gap-definable, including P, P, PSPACE, EX...
متن کاملGap-deenability as a Closure Property ?
Gap-deenability and the gap-closure operator were deened in FFK91]. Few complexity classes were known at that time to be gap-deenable. In this paper, we give simple characterizations of both gap-deenability and the gap-closure operator, and we show that many complexity classes are gap-deenable, including P #P , P #P1] , PSPACE, EXP, NEXP, MP, and BP P. If a class is closed under union, intersec...
متن کاملDefinability properties and the congruence closure
We introduce a natural class of quantifiers Th containing all monadic type quantifiers, all quantifiers for linear orders, quantifiers for isomorphism, Ramsey type quantifiers, and plenty more, showing that no sublogic of Lo~o,(Th) or countably compact regular sublogic of L~o,(Th), properly extending L,o,o, satisfies the uniform reduction property for quotients. As a consequence, none of these ...
متن کاملDomain Closure Conditions and Definability Preservation
We show in Section (2) the importance of closure of the domain under finite unions, in particular for Cumulativity, and representation results. We see that in the absence of this closure, Cumulativity fans out to an infinity of different conditions. We introduce in Section (3) the concept of an algebraic limit, and discuss its importance. We then present a representation result for a new concep...
متن کاملDefinability as hypercomputational effect
The classical simulation of physical processes using standard models of computation is fraught with problems. On the other hand, attempts at modelling real-world computation with the aim of isolating its hypercomputational content have struggled to convince. We argue that a better basic understanding can be achieved through computability theoretic deconstruction of those physical phenomena most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1996
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0080